Characterizing path graphs by forbidden induced subgraphs
نویسندگان
چکیده
A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009
منابع مشابه
On characterizing game-perfect graphs by forbidden induced subgraphs
A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs. Moreover, we ...
متن کاملAsteroidal quadruples in non rooted path graphs
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to ...
متن کاملCharacterization of graphs dominated by induced paths
We give a characterization, in terms of forbidden induced subgraphs, of those graphs in which every connected induced subgraph has a dominating induced path on at most k vertices (k 3). We show, in particular, that k = 4 means precisely the class of domination-reducible graphs, whose original definition applied four types of structural reduction. © 2006 Elsevier B.V. All rights reserved.
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملPolar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a partition A, B of its vertex set such that A induces a complete s-partite graph (i.e., a collection of at most s disjoint stable sets with complete links between all sets) and B a disjoint union of at most k cliques (i....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 62 شماره
صفحات -
تاریخ انتشار 2009